On Supporting Hierarchical Data in Relational Main-Memory Database Systems
نویسنده
چکیده
Hierarchical data is prevalent in a number of business use cases. However, most business data is stored in a relational database and hierarchical data is somehow encoded relationally. Since most queries on hierarchies also feature relational data, companies must continue maintaining their hierarchical data in a relational database system. There are many challenges when storing and querying hierarchical data in a relational context, because tables are inherently flat data structures while hierarchies possess inherent recursive properties. This impedance mismatch calls for dedicated hierarchy support in relational database systems: A user-friendly front end for querying hierarchical data and a sophisticated back end for evaluating these queries efficiently. In addition, hierarchies are usually dynamic with a high rate of complex, structural updates being issued on them. The aim of this thesis is to take on all these challenges. We propose a holistic framework for maintaining and querying hierarchical data in a modern main-memory relational database system. We design a data model for unifying hierarchical and relational data. Based on this model, we propose a query language, which blends seamlessly into SQL and allows the intuitive phrasing of queries working simultaneously on hierarchical and relational data. We then devise a family of indexing schemes to index hierarchical data effectively by enabling efficient queries and updates. We show how the proposed indexes can be used to answer queries in our SQL extension, thus providing all building blocks for our hierarchy framework. We then extend the framework with indexes for versioned hierarchical data, since many use cases require versioning for traceability and confirmability purposes. Finally, we propose an algorithm for the change recognition in hierarchies, which is important for versioning and completes our hierarchy framework. As our experiments on real-world data of SAP customers show, our framework enables unprecedented performance and is the first approach to handle complex updates efficiently. The fact that parts of our framework have already been shipped with the latest release of the SAP HANA Vora in-memory query engine [85] proves that our work is not only of theoretical scientific interest but adds real business value to a relational system.
منابع مشابه
Main Memory Databases vs. Disk-Resident Databases
Storing all database data in memory is an idea that many researchers have been studying it from mid-1980s when RAM prices decreased while their capacity increased. Main Memory Database systems (MMDB) are an efficient solution to store all database data in main physical memory. Conventional database systems like relational databases are optimized for disk I/O operations but Memory resident datab...
متن کاملHierarchical Query Execution in a Parallel Object-Oriented Database System
This article presents a hierarchical query execution strategy for a parallel object-oriented database (OODB) system. The system, named PRACTIC, is based on a concurrent active class management model and is mapped to an abstract hierarchical multiprocessor architecture. The proposed strategy is studied analytically and by simulation on a transputer-based machine, verifying the theoretical result...
متن کاملQuery Processing in Main Memory Database Man- Agement Systems. in Acm Sigmod International Conf. on Management of Data
A study of index structures for main memory database management systems.
متن کاملOn Scalable and Flexible Transaction and Query Processing in Main-Memory Database Systems
The hardware landscape for database systems has changed dramatically over the past two decades. Today, the traditional database system architecture that was pioneered by System R and is implemented by IBM DB2, Microsoft SQL Server, Oracle and Postgres, shows weaknesses in all major areas of application of commercial database systems: operational transaction processing, decision support and busi...
متن کاملMetadata Enrichment for Automatic Data Entry Based on Relational Data Models
The idea of automatic generation of data entry forms based on data relational models is a common and known idea that has been discussed day by day more than before according to the popularity of agile methods in software development accompanying development of programming tools. One of the requirements of the automation methods, whether in commercial products or the relevant research projects, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016